搜索资源列表
3D-BPP
- 3DBPP BRANCH AND BOUND
TravelingSalespersonProblem_TSP_codes
- Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the
bestsearch
- 分支定界,找出最优解,此编程是以六个特征为例进行编程的。-Branch and bound, to find the optimal solution, this program is based on six characteristics of the program as an example.
optimal-decision
- 最优决策——用几个matlab编程的实例阐述分支定界法的思想是:首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds
750
- A branch-and-bound algorithm for asymmetric TSP
d_function
- 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.
game1
- 分支限界法算法作业:图形变换问题解题报告和源代码。问题描述:给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法,计算最少需要多少步变换,才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source
backpackbranchandbound
- 这是传统智能优化背包问题用VC++ 6.0的实现,是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
submission.tar
- Branch and bound is one of the best complete. algorithms for the tsp decision problem
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
TSP
- this a branch and bound code for TSP-this is a branch and bound code for TSP
matlabmiaoshu
- 分支定界法的matlab描述,其中有具体的代码信息 -Branch and bound method described in matlab
metody
- branch and bound tsp
Desktop
- 实验四:分枝限界算法设计 实现课本上旅行售货员问题的分枝限界算法(P225),随机生成两个规模为10和20的TSP实例,比较算法运行时间。 提交源代码以及实验报告。 -Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Bound algorithm (P225), randomly g
BranchandBound_01backpack
- 0-1背包问题是一个经典的算法问题,有多种解法,这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
BranchBound
- 最优化问题中分枝定界法求解整数线性规划问题-Optimization of branch and bound method for solving integer linear programming problem
nqueens
- 分支限界法解决皇后问题,在nxn棋盘上放n个棋子,要求两个棋子不能放在同一列上-Queens branch and bound method to solve the problem, put the board in the nxn n-piece, two pieces can not be requested on the same column
TSP
- 这是用Delphi编写的程序,目的是用TSP(分支限界法)实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem
main
- 分支限界法实现旅行售货员问题,使用时间挺短的,代码可读性强-Branch and bound to achieve the traveling salesman problem, the use of time very short, readable code
wrewwererw
- 分支限界法解决——TSP问题的讲述,及其算法(是PPT)-Branch and bound method to solve- TSP problem about its algorithm (which is PPT)